AG codes on certain maximal curves
نویسندگان
چکیده
Algebraic Geometric codes associated to a recently discovered class of maximal curves are investigated. As a result, some linear codes with better parameters with respect to the previously known ones are discovered, and 70 improvements on MinT’s tables [1] are obtained.
منابع مشابه
One-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملAG codes and AG quantum codes from cyclic extensions of the Suzuki and Ree curves
We investigate several types of linear codes constructed from two families S̃q and R̃q of maximal curves over finite fields recently constructed by Skabelund as cyclic covers of the Suzuki and Ree curves. Plane models for such curves are provided, and the Weierstrass semigroup H(P ) at an Fq-rational point P is shown to be symmetric.
متن کاملOn the rank of certain parametrized elliptic curves
In this paper the family of elliptic curves over Q given by the equation Ep :Y2 = (X - p)3 + X3 + (X + p)3 where p is a prime number, is studied. Itis shown that the maximal rank of the elliptic curves is at most 3 and someconditions under which we have rank(Ep(Q)) = 0 or rank(Ep(Q)) = 1 orrank(Ep(Q))≥2 are given.
متن کاملMulti-point Codes from the GGS Curves
This paper is concerned with the construction of algebraic geometric codes defined from GGS curves. It is of significant use to describe bases for the Riemann-Roch spaces associated to some totally ramified places, which enables us to study multi-point AG codes. Along this line, we characterize explicitly the Weierstrass semigroups and pure gaps by an exhaustive computation of the basis for Rie...
متن کاملMagma Implementation of Decoding Algorithms for General Algebraic Geometry Codes
Goppa’s codes on algebraic curves defined over finite fields, called AG codes, are usually regarded as the most successful class of error correcting codes in theory as well as in practice. The class of AG codes provides series of constructible codes with large minimum distance that surpasses the Gilbert-Varshamov bound. Through the 80’s and 90’s, researchers devised efficient decoding algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0906.2935 شماره
صفحات -
تاریخ انتشار 2009